求解广义纳什均衡问题的指数型惩罚函数方法

本文利用指数型惩罚函数部分地惩罚耦合约束,从而将广义纳什均衡问题(GNEP)的求解转化为求解一系列光滑的惩罚纳什均衡问题 (NEP)。我们证明了若光滑的惩罚NEP序列的解序列的聚点处EMFCQ成立,则此聚点是 GNEP的一个解。进一步,我们把惩罚 NEP的KKT条件转化为一个非光滑方程系统,然后应用带有 Armijo 线搜索的半光滑牛顿法来求解此系统。最后,数值结果表明我们的指数型惩罚函数方法是有效的。     

A note on efficient signaling of bargaining power

Strategic delay and restricted offers are two modes of signaling bargaining power in alternating offers bargaining games. This paper shows that when both modes are available, the best signaling strategy of the “strong” type of the informed player consists of a pure strategic delay followed by an offer on the whole pie. There is no signaling motivation for issue-by-issue bargaining when the issues are perfectly substitutable. Received: July 1996/Final version: August 1999     

On the sensitivity matrix of the Nash bargaining solution

In this note we provide a characterization of a subclass of bargaining problems for which the Nash solution has the property of disagreement point monotonicity. While the original d-monotonicity axiom and its stronger notion, strong d-monotonicity, were introduced and discussed by Thomson (J Econ Theory, 42: 50–58, 1987), this paper introduces local strong d-monotonicity and derives a necessary and sufficient condition for the Nash solution to be locally strongly d-monotonic. This characterization is given by using the sensitivity matrix of the Nash bargaining solution w.r.t. the disagreement point d. Moverover, we present a sufficient condition for the Nash solution to be strong d-monotonic.     

Generalized Nash equilibrium problem, variational inequality and quasiconvexity

It is well known that the generalized Nash equilibrium problem, a model for multi-leader–follower games, can be reformulated as a quasivariational inequality. We show that, in fact, a reformulation in terms of a variational inequality can be obtained in the general setting of quasiconvex nondifferentiable decision functions. An existence result is deduced.     

Constrained cost-coupled stochastic games with independent state processes

We study non-cooperative constrained stochastic games in which each player controls its own Markov chain based on its own state and actions. Interactions between players occur through their costs and constraints which depend on the state and actions of all players. We provide an example from wireless communications.     

Coordination mechanisms for inventory control in three-echelon serial and distribution systems

This paper is concerned with the coordination of inventory control in three-echelon serial and distribution systems under decentralized control. All installations in these supply chains track echelon inventories. Under decentralized control the installations will decide upon base stock levels that minimize their own inventory costs. In general these levels do not coincide with the optimal base stock levels in the global optimum of the chain under centralized control. Hence, the total cost under decentralized control is larger than under centralized control. To remove this cost inefficiency, two simple coordination mechanisms are presented: one for serial systems and one for distribution systems. Both mechanisms are initiated by the most downstream installation(s). The upstream installation increases its base stock level while the downstream installation compensates the upstream one for the increase of costs and provides it with a part of its gain from coordination. It is shown that both coordination mechanisms result in the global optimum of the chain being the unique Nash equilibrium of the corresponding strategic game. Furthermore, all installations agree upon the use of these mechanisms because they result in lower costs per installation. The practical implementation of these mechanisms is discussed.     

抽象凸空间中集值映射的不动点定理及其应用

A new fixed point theorem and the selection property for upper semi-continuous set-valued mappings in abstract convexity space are established. As their applications the existence of Nash equilibrium for n-person non-cooperative generalized games is proved.     

模糊值二人零和对策的Nash均衡策略

我们将在Ramik定义的模糊最大序关系基础上研究模糊环境中的二人零和对策。在非对称模糊数基础上,引入模糊环境中的几种Nash均衡策略,讨论各种均衡策略存在的充要条件。并引入含参变量确定性矩阵对策及其均衡策略的概念,讨论含参变量确定性矩阵对策的Nash均衡策略和模糊值矩阵对策的均衡策略的关系。     

Structural stability and robustness to bounded rationality for non-compact cases

We study the model M consisting of “general games” with noncompact action space, together with an associated abstract rationality function. We prove that M is structurally stable and robust to ϵ-equilibria for “almost all” parameters. As applications, we investigate structural stability and robustness to bounded rationality for noncooperative games, multiobjective optimizations and fixed point problems satisfying existence and some continuity conditions. Specifically, we introduce concrete rationality functions for such three kinds of problems with both payoffs and strategy sets, objective functions and domain spaces, and correspondence and domain spaces as parameters, respectively, and show the generic structural stability and robustness to bounded rationality for the corresponding model Ms.     

Regularity of Nash payoffs of Markovian nonzero-sum stochastic differential games

In this paper we deal with the problem of existence of a smooth solution of the Hamilton–Jacobi–Bellman–Isaacs (HJBI for short) system of equations associated with nonzero-sum stochastic differential games. We consider the problem in unbounded domains either in the case of continuous generators or for discontinuous ones. In each case we show the existence of a smooth solution of the system. As a consequence, we show that the game has smooth Nash payoffs which are given by means of the solution of the HJBI system and the stochastic process which governs the dynamic of the controlled system.